On the Fermat-Weber center of a convex object
نویسندگان
چکیده
We show that for any convex object Q in the plane, the average distance from the Fermat-Weber center of Q to the points in Q is at least ∆(P )/7, where ∆(P ) is the diameter of P , and that there exists a convex object for which this distance is ∆(P )/6. We use this result to obtain a linear-time approximation scheme for finding an approximate Fermat-Weber center of a convex polygon Q.
منابع مشابه
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4∆(Q)/25, and at most 2∆(Q)/(3 √ 3), where ∆(Q) is the diameter of Q. We use the former bound to improve the approximation ratio of a load-balancing algorithm of Aronov et al. [2].
متن کاملNew Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the plane, the average distance from the Fermat-Weber center of Q to the points of Q is larger than 16 · ∆(Q), where ∆(Q) is the diameter of Q. This proves a conjecture of Carmi, HarPeled and Katz. From the other direction,...
متن کاملOn the continuous Fermat-Weber problem for a convex polygon using Euclidean distance
In this paper, we consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point to the continuously distributed customers along the boundary. A Weiszfeld-type procedure is proposed for this model, which is shown to be linea...
متن کاملSolving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms
Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...
متن کاملThe Newton Bracketing method for the minimization of convex functions subject to affine constraints
The Newton Bracketing method [9] for the minimization of convex functions f : Rn → R is extended to affinely constrained convex minimization problems. The results are illustrated for affinely constrained Fermat–Weber location problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 32 شماره
صفحات -
تاریخ انتشار 2005